Parallel Tree Search in Volunteer Computing: a Case Study
نویسندگان
چکیده
منابع مشابه
Cumulating Search in a Distributed Computing Environment : A Case Study in Parallel Satis abilityHantao
We present a parallel propositional satissability (SAT) prover called PSATO for networks of workstations. PSATO is based on the sequential SAT prover SATO, which is an eecient implementation of the Davis-Putnam algorithm. The master-slave model is used for communication. A simple and eeective workload balancing method distributes the workload among workstations. A key property of our method is ...
متن کاملCumulating Search in a Distributed Computing Environment: A Case Study in Parallel Satisfiability
We present a parallel propositional satisfiability (SAT) prover called PSATO for networks of workstations. PSATO is based on the sequential SAT prover SATO, which is an efficient implementation of the Davis-Putnam algorithm. The master-slave model is used for communication. A simple and effective workload balancing method distributes the workload among workstations. A key property of our method...
متن کاملVolunteer computing
The explosive growth of interest in platform-independent programming languages for the WorldWide Web , such as Sun Microsystems' Java, is opening exciting new possibilites in parallel computing. This thesis will present and investigate the idea of volunteer computing, which will allow people to volunteer their computers' processing power towards solving a large parallel problem by simply visiti...
متن کاملParallel Backprojection: A Case Study in High-Performance Reconfigurable Computing
High-performance reconfigurable computing (HPRC) is a novel approach to provide large-scale computing power to modern scientific applications. Using both general-purpose processors and FPGAs allows application designers to exploit fine-grained and coarse-grained parallelism, achieving high degrees of speedup. One scientific application that benefits from this technique is backprojection, an ima...
متن کاملA Parallel Monte-Carlo Tree Search Algorithm
Monte-Carlo tree search is a powerful paradigm for the game of Go. We present a parallel Master-Slave algorithm for Monte-Carlo tree search. We experimented the algorithm on a network of computers using various configurations: from 12,500 to 100,000 playouts, from 1 to 64 slaves, and from 1 to 16 computers. On our architecture we obtain a speedup of 14 for 16 slaves. With a single slave and fiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Grid Computing
سال: 2017
ISSN: 1570-7873,1572-9184
DOI: 10.1007/s10723-017-9411-5